Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric compuation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its Applications on September 18-22, 2006 at the University of Minnesota is one tangible indication of the interest. One hundred ten participants from eleven countries and twenty states came to listen to the many talks; discuss mathematics; and pursue collaborative work on the many faceted problems and the algorithms, both symbolic and numberic, that illuminate them. This volume of articles captures some of the spirit of the IMA workshop.

Mathematics. --- Algebraic Geometry. --- Algorithms. --- Applications of Mathematics. --- Geometry, algebraic. --- Mathématiques --- Algorithmes --- Algorithms -- Congresses. --- Geometry, Algebraic -- Data processing -- Congresses. --- Geometry, Algebraic -- Data processing. --- Geometry, Algebraic --- Algorithms --- Geometry --- Mathematics --- Physical Sciences & Mathematics --- Data processing --- Algebraic geometry --- Algebraic geometry. --- Applied mathematics. --- Engineering mathematics. --- Math --- Science --- Algorism --- Algebra --- Arithmetic --- Foundations --- Engineering --- Engineering analysis --- Mathematical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The series of MFCS symposia, organized in rotation by Poland, Slovakia, and the Czech Republic since 1972, has a long and well-established tradition. The symposiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputer science.Their broadscopeprovidesanopportunityto bring together researchers whodonotusuallymeetatspecialized conferences. The 35th International Symposium on Mathematical Foundations of C- puter Science (MFCS 2010) was organized in parallel with the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010). The federated MFCS and CSL 2010 conference had shared plenary sessions and social events forallparticipants,butthescienti?cprogramandtheproceedingswereprepared independently for both events. Out of 149 regular submissions to MFCS 2010, the Program Committee - lected 56 papers for presentation at the conference and publication in this v- ume. Each paper was reviewed by at least three Program Committee members with the help of outside experts, and the actual selection was based on a sub- quent electronic discussion. In addition to the contributed papers, the scienti?c program of MFCS 2010 included ?ve MFCS and CSL plenary talks delivered by David Basin (ETH Z¨ urich),HerbertEdelsbrunner (IST Austria andDuke University),ErichGrad ¨ el (RWTH Aachen), Bojan Mohar (University of Ljubljana and Simon Fraser U- versity),andJosephSifakis (CNRS), andthree invitedMFCS lecturesby Andris Ambainis (University of Latvia), Juraj Hromkovi?c(ETHZur ¨ ich), and Daniel Lokshtanov (Universitetet i Bergen). We are grateful to the invited speakers for accepting our invitation and sharing their knowledge and skills with all MFCS 2010 participants.

Computer programming --- Algorithms --- Computable functions --- Machine theory --- Programmation (Informatique) --- Algorithmes --- Fonctions calculables --- Automates mathématiques, Théorie des --- Congresses. --- Congrès --- Automates mathématiques, Théorie des --- Congrès --- EPUB-LIV-FT LIVINFOR SPRINGER-B

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed proceedings of the 6th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2008, held in Brussels, Belgium, in September 2008. The 17 revised full papers, 24 revised short papers, and 10 extended abstracts presented were carefully reviewed and selected from 91 submissions. The papers cover theoretical and foundational aspects of computational intelligence and related disciplines with special focus on swarm intelligence and are devoted to behavioral models of social insects and new algorithmic approaches, empirical and theoretical research in swarm intelligence, applications such as ant colony optimization or particle swarm optimization, and theoretical and experimental research in swarm robotics systems.

Computer. Automation --- robots --- Computer architecture. Operating systems --- informatica --- computernetwerken --- numerieke analyse --- Artificial intelligence. Robotics. Simulation. Graphics --- complexe analyse (wiskunde) --- Discrete mathematics --- discrete wiskunde --- Complex analysis --- Computer science --- Ant algorithms --- Algorithmes de colonies de fourmis --- Congresses. --- Congrès --- EPUB-LIV-FT LIVINFOR SPRINGER-B --- Artificial intelligence. --- Computer science. --- Computer Communication Networks. --- Computer software. --- Electronic data processing. --- Artificial Intelligence. --- Programming Techniques. --- Algorithm Analysis and Problem Complexity. --- Computation by Abstract Devices. --- Numeric Computing. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Software, Computer --- Computer systems --- Informatics --- Science --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Automation --- Computer programming. --- Computer communication systems. --- Algorithms. --- Computers. --- Numerical analysis. --- Mathematical analysis --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Cybernetics --- Calculators --- Cyberspace --- Algorism --- Algebra --- Arithmetic --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Foundations --- Distributed processing --- Programming --- Ant-inspired algorithms --- Algorithms --- Mathematical optimization --- Computer networks. --- Theory of Computation. --- Numerical Analysis.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scientists in algorithm design, statistical design, optimization and heuristics, and most chapters provide theoretical background and are enriched with case studies. This book is written for researchers and practitioners in operations research and computer science who wish to improve the experimental assessment of optimization algorithms and, consequently, their design.

Statistical science --- Operational research. Game theory --- Mathematical statistics --- Planning (firm) --- Business management --- Computer science --- Computer. Automation --- complexiteit --- stochastische analyse --- informatica --- management --- mathematische modellen --- statistiek --- informatietechnologie --- econometrie --- algoritmen --- operationeel onderzoek --- statistisch onderzoek --- Computer algorithms. --- Mathematical optimization. --- Mathematical statistics. --- Operations research. --- Management science. --- Algorithms. --- Statistics . --- Computational complexity. --- Probability and Statistics in Computer Science. --- Operations Research, Management Science. --- Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences. --- Complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Statistical analysis --- Statistical data --- Statistical methods --- Mathematics --- Econometrics --- Quantitative business analysis --- Management --- Problem solving --- Operations research --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Algorism --- Algebra --- Arithmetic --- Foundations

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Massive datasets, made available today by modern technologies, present a significant challenge to scientists who need to effectively and efficiently extract relevant knowledge and information. Due to their ability to model uncertainty, interval and soft computing techniques have been found to be effective in this extraction. This book provides coverage of the basic theoretical foundations for applying these techniques to artificial intelligence and knowledge processing. The first three chapters provide the background needed for those who are unfamiliar with interval and soft computing techniques. The following chapters describe innovative algorithms and their applications to knowledge processing. In particular, these chapters cover computing techniques for interval linear systems of equations, interval matrix singular-value decomposition, interval function approximation, and decision making with statistical and graph-based data processing. To enable these applications, the book presents a standards-based object-oriented interval computing environment in C++. By providing the necessary background and summarizing recent results and successful applications, this self-contained book will serve as a useful resource for researchers and practitioners wanting to learn interval and soft computing techniques and apply them to artificial intelligence and knowledge processing.

Computer Science. --- Artificial Intelligence (incl. Robotics). --- Discrete Mathematics in Computer Science. --- Applications of Mathematics. --- Data Mining and Knowledge Discovery. --- Information Systems Applications (incl.Internet). --- Computer science. --- Computational complexity. --- Data mining. --- Information systems. --- Artificial intelligence. --- Mathematics. --- Informatique --- Complexité de calcul (Informatique) --- Exploration de données (Informatique) --- Intelligence artificielle --- Mathématiques --- Information storage and retrieval systems --- Systèmes d'information --- Computer algorithms. --- Interval analysis (Mathematics). --- Soft computing. --- Data mining --- Computer algorithms --- Soft computing --- Interval analysis (Mathematics) --- Computer Science --- Engineering & Applied Sciences --- Analysis, Interval --- Arithmetic, Interval --- Interval arithmetic --- Interval mathematics --- Mathematics, Interval --- Algorithmic knowledge discovery --- Factual data analysis --- KDD (Information retrieval) --- Knowledge discovery in data --- Knowledge discovery in databases --- Mining, Data --- Computer science --- Applied mathematics. --- Engineering mathematics. --- Information Systems Applications (incl. Internet). --- Database searching --- Engineering --- Engineering analysis --- Mathematical analysis --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Computer mathematics --- Discrete mathematics --- Informatics --- Science --- Mathematics --- Cognitive computing --- Computational intelligence --- Numerical analysis --- Algorithms --- Artificial Intelligence. --- Complexity, Computational --- Math --- Application software. --- Computer science—Mathematics. --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software